Bayesian Multitask Distance Metric Learning

نویسندگان

  • Piyush Rai
  • Wenzhao Lian
  • Lawrence Carin
چکیده

We present a Bayesian approach for jointly learning distance metrics for a large collection of potentially related learning tasks. We assume there exists a relatively smaller set of basis distance metrics and the distance metric for each task is a sparse, positively weighted combination of these basis distance metrics. The set of basis distance metrics and the combination weights are learned from data. Moreover, taking a nonparametric Bayesian approach, the number of basis distance metrics need not be set a priori. Our proposed construction significantly reduces the number of parameters to be learned, especially when the number of tasks and/or data dimensionality is large. Several existing methods for multitask/transfer distance metric learning arise as special cases of our model. Preliminary results on real-world data show that our model outperforms various baselines. We also discuss some possible extensions of our model and future work.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exploiting Task Relatedness for Multitask Learning of Bayesian Network Structures

We address the problem of learning Bayesian networks for a collection of unsupervised tasks when limited data is available and a metric of the relatedness of tasks is given. We exploit this valuable information about taskrelatedness to learn more robust structures for each task than those learned with a standard multitask learning algorithm. Our approach is the first network structure learning ...

متن کامل

Bayesian Active Distance Metric Learning

Distance metric learning is an important component for many tasks, such as statistical classification and content-based image retrieval. Existing approaches for learning distance metrics from pairwise constraints typically suffer from two major problems. First, most algorithms only offer point estimation of the distance metric and can therefore be unreliable when the number of training examples...

متن کامل

Character Recognition by Adaptive Statistical Similarity

Handwriting recognition and OCR systems need to cope with a wide variety of writing styles and fonts, many of them possibly not previously encountered during training. This paper describes a notion of Bayesian statistical similarity and demonstrates how it can be applied to rapid adaptation to new styles. The ability to generalize across different problem instances is illustrated in the Gaussia...

متن کامل

Bayesian Multitask Learning with Latent Hierarchies

We learn multiple hypotheses for related tasks under a latent hierarchical relationship between tasks. We exploit the intuition that for domain adaptation, we wish to share classifier structure, but for multitask learning, we wish to share covariance structure. Our hierarchical model is seen to subsume several previously proposed multitask learning models and performs well on three distinct rea...

متن کامل

یادگیری نیمه نظارتی کرنل مرکب با استفاده از تکنیک‌های یادگیری معیار فاصله

Distance metric has a key role in many machine learning and computer vision algorithms so that choosing an appropriate distance metric has a direct effect on the performance of such algorithms. Recently, distance metric learning using labeled data or other available supervisory information has become a very active research area in machine learning applications. Studies in this area have shown t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014